A Primal-Dual Decomposition-Based Interior Point Approach to Two-Stage Stochastic Linear Programming
نویسندگان
چکیده
Decision making under uncertainty is a challenge faced by many decision makers. Stochastic programming is a major tool developed to deal with optimization with uncertainties that has found applications in, e.g. finance, such as asset-liability and bond-portfolio management. Computationally however, many models in stochastic programming remain unsolvable because of overwhelming dimensionality. For a model to be well solvable, its special structure must be explored. Most of the solution methods are based on decomposing the data. In this paper we propose a new decomposition approach for two-stage stochastic programming, based on a direct application of the path-following method combined with the homogeneous self-dual technique. Numerical experiments show that our decomposition algorithm is very efficient for solving stochastic programs. In particular, we apply our decomposition method to a two-period portfolio selection problem using options on a stock index. In this model the investor can invest in a money-market account, a stock index, and European options on this index with different maturities. We experiment our model with market prices of options on the S&P500. AMS Classification: 49M27 (Decomposition Methods), 90C06 (Large-Scale Problems), 90C15 (Stochastic Programming). JEL Classification: C61 (Optimization Techniques), G11 (Portfolio Choice) ∗Econometric Institute, Erasmus University Rotterdam, P.O.Box 1738, 3000 DR Rotterdam, The Netherlands, [email protected]. †ABN-AMRO Asset Management; Faculty of Economic Sciences and Econometrics, Free University of Amsterdam, The Netherlands, [email protected]. ‡ABN-AMRO Asset Management; Econometric Institute, Erasmus University Rotterdam, The Netherlands, [email protected]. §Corresponding Author. Department of Systems Engineering & Engineering Management, The Chinese University of Hong Kong, Shatin, Hong Kong, [email protected].
منابع مشابه
ABS Solution of equations of second kind and application to the primal-dual interior point method for linear programming
Abstract We consider an application of the ABS procedure to the linear systems arising from the primal-dual interior point methods where Newton method is used to compute path to the solution. When approaching the solution the linear system, which has the form of normal equations of the second kind, becomes more and more ill conditioned. We show how the use of the Huang algorithm in the ABS cl...
متن کاملA Primal-Dual Interior Point and Decomposition Approach to Multi-Stage Stochastic Programming
How to make decisions while the future is full of uncertainties is a major problem shared virtually by every human being including housewives, firm managers, as well as politicians. In this paper we introduce a mathematical programming resolution to the problem, namely multi-stage stochastic programming. An advantage of that approach is obviously that we will be working with a precise, tangible...
متن کاملA Two Stage Stochastic Programming Model of the Price Decision Problem in the Dual-channel Closed-loop Supply Chain
In this paper, we propose a new model for designing integrated forward/reverse logistics based on pricing policy in direct and indirect sales channel. The proposed model includes producers, disposal center, distributers and final customers. We assumed that the location of final customers is fixed. First, a deterministic mixed integer linear programming model is developed for integrated logistic...
متن کاملPrimal-dual path-following algorithms for circular programming
Circular programming problems are a new class of convex optimization problems that include second-order cone programming problems as a special case. Alizadeh and Goldfarb [Math. Program. Ser. A 95 (2003) 3-51] introduced primal-dual path-following algorithms for solving second-order cone programming problems. In this paper, we generalize their work by using the machinery of Euclidean Jordan alg...
متن کاملScalable Parallel Benders Decomposition for Stochastic Linear Programming
We develop a scalable parallel implementation of the classical Benders decomposition algorithm for two-stage stochastic linear programs. Using a primal-dual, path-following algorithm for solving the scenario subproblems we develop a parallel implementation that alleviates the diiculties of load balancing. Furthermore, the dual and primal step calculations can be implemented using a data-paralle...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Operations Research
دوره 50 شماره
صفحات -
تاریخ انتشار 2002